Application of Genetic Algorithms to Solve MTSP Problems with Priority (Case Study at the Jakarta Street Lighting Service)

Transportation is one thing that very important and the highest cost in supply chain. One way to reduce these costs optimize vehicle routes. The Multiple Traveling Salesman Problem (MTSP) Capacitated Vehicle Routing (CVRP) are models have been extensively researched In its development based on actual events real world, some priorities must be visited first optimizing Several studies MTSP CVRP conducted with exact solutions algorithms. a case Jakarta City Street Lighting Section, problem of determining route three shifts crucial resolved increase worker productivity improve services. Services MCB (Miniature Circuit Breaker) installation maintenance activities for general street lights priority given light points require replacement. Because, this case, delivery capacity not taken into account, random, number enormous, study, we use method solve by genetic algorithm assisted nearest neighbor algorithm. From resolution problem, it was found travel time reduction 32 % shift 1, 24 2, 23 3. Of course, will impact so can done faster all replace dead lamp.